Abstract computability and algebraic specification

Abstract Computability, Algebraic Specification and Initiality

Computability and Algebraic Specifications Abstract Abstract computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all absract computable functions on any many-sorted algebra; and (ii) all functions effectively approximable by abstract ...

Algebraic Specification of Abstract Data Types

Data Types,

A Kernel Language for Algebraic Specification and Implementation - Extended Abstract

Abatrect A kernel specification language called ASL is presented. ASL comprises five fundamental but powerful specificationbuilding operations and has a simple semantics. Behavioural abstraction with respect to a set of observable sorts san be expressed, and (recurstve) parameterisad specifications can be defined using a more powerful and more expressive parameterisation mechanism than usual. A...

Computability in Specification

In reference (Foundation of specification. Journal of Logic and Computation, 15, 951–974, 2005), the author introduces a core specification theory (CST) in order to provide a logical framework for the design and exploration of specification languages. In this article, we formulate two highly expressive extensions of CST. The first (CSTU) is CST þ a universe of types and the second (CSTUS) permi...

Randomness, Computability, and Algebraic Specifications